Sweepline the Music!
نویسندگان
چکیده
The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of size m within another point set of size n we give an algorithm with running time O(mn), and for finding partial occurrences an algorithm with running time O(mn logm). To find the largest overlap between two line segment patterns we develop an algorithm with running time O(mn log(mn)). All algorithms are based on a simple sweepline traversal of one of the patterns in the lexicographic order. The motivation for the problems studied comes from music retrieval and analysis.
منابع مشابه
Sweepline and Recursive Geometric Algorithms for Melodic Similarity
This extended abstract gives an overview on two contentbased retrieval algorithms for symbolic music, developed earlier in the C-BRAHMS group [1], that took part in the Symbolic Melodic Similarity and Query by Singing/Humming tasks of the MIREX 2006 contest [3, 4]. Given two excerpts of symbolically encoded monophonic or polyphonic music, the query pattern and the target music, the purpose of t...
متن کاملTransposition and Time-Scale Invariant Geometric Music Retrieval
This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations required by real-world applications. In this setting, music is represented by sets of points in plane. A matching, pertinent to the application, involves two such sets of points and invariances under translations and time scali...
متن کاملA sweepline algorithm for Euclidean Voronoi diagram of circles
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bot...
متن کاملA new compound algorithm study for delaunay triangulation construction
Delaunay triangulation is always used to construct TIN, and is also widely applied in manifold fields, for it can avoid long and skinny triangles resulting in a nice looking map. A wide variety of algorithms have been proposed to construct delaunay triangulation, such as divide-and-conquer, incremental insertion, trangulation growth, and so on. The compound algorithm is also researched to const...
متن کاملDynamic Programming in Transposition and Time-Warp Invariant Polyphonic Content-Based Music Retrieval
We consider the problem of transposition and time-warp invariant (TTWI) polyphonic content-based music retrieval (CBMR) in symbolically encoded music. For this setting, we introduce two new algorithms based on dynamic programming. Given a query point set, of sizem, to be searched for in a database point set, of size n, and applying a search window of width w, our algorithms run in time O(mnw) f...
متن کامل